\hypertarget{johnson_8h}{}\section{src/graph\+\_\+algorithms/all\+\_\+node\+\_\+pair\+\_\+shortest\+\_\+path/johnson/johnson.h File Reference}
\label{johnson_8h}\index{src/graph\+\_\+algorithms/all\+\_\+node\+\_\+pair\+\_\+shortest\+\_\+path/johnson/johnson.\+h@{src/graph\+\_\+algorithms/all\+\_\+node\+\_\+pair\+\_\+shortest\+\_\+path/johnson/johnson.\+h}}
{\ttfamily \#include $<$memory$>$}\\*
{\ttfamily \#include \char`\"{}src/header.\+h\char`\"{}}\\*
{\ttfamily \#include \char`\"{}../../basic\+\_\+graph/graph\+\_\+representation/graph/graph.\+h\char`\"{}}\\*
{\ttfamily \#include \char`\"{}../../single\+\_\+source\+\_\+shortest\+\_\+path/bellman\+\_\+ford/bellmanford.\+h\char`\"{}}\\*
{\ttfamily \#include \char`\"{}../../single\+\_\+source\+\_\+shortest\+\_\+path/dijkstra/dijkstra.\+h\char`\"{}}\\*
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \hyperlink{namespace_introduction_to_algorithm}{Introduction\+To\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of Introdunction\+To\+Algorithm. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm}{Graph\+Algorithm}. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename Graph\+Type $>$ }\\std\+::shared\+\_\+ptr$<$ Graph$<$ Graph\+Type\+::\+N\+U\+M+1, typename Graph\+Type\+::\+Vertex\+Type $>$ $>$ \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm_a267d39a5bb09200f37a1cd2f0ad4f69f}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm\+::graph\+\_\+plus\+\_\+1v} (std\+::shared\+\_\+ptr$<$ Graph\+Type $>$ graph)
\begin{DoxyCompactList}\small\item\em graph\+\_\+plus\+\_\+1v：根据图graph生成一个新图。算法导论25章25.2节 \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Graph\+Type $>$ }\\std\+::array$<$ std\+::array$<$ typename Graph\+Type\+::\+E\+Weight\+Type,Graph\+Type\+::\+N\+U\+M $>$, Graph\+Type\+::\+N\+U\+M $>$ \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm_a856b132d068d0553355203a16cdec97d}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm\+::johnson} (std\+::shared\+\_\+ptr$<$ Graph\+Type $>$ graph)
\begin{DoxyCompactList}\small\item\em johnson：返回所有节点对的最短路径的johnson算法。算法导论25章25.3节 \end{DoxyCompactList}\end{DoxyCompactItemize}
